全文获取类型
收费全文 | 3462篇 |
免费 | 247篇 |
国内免费 | 126篇 |
专业分类
化学 | 212篇 |
晶体学 | 2篇 |
力学 | 282篇 |
综合类 | 54篇 |
数学 | 2773篇 |
物理学 | 512篇 |
出版年
2024年 | 3篇 |
2023年 | 34篇 |
2022年 | 31篇 |
2021年 | 56篇 |
2020年 | 54篇 |
2019年 | 49篇 |
2018年 | 46篇 |
2017年 | 49篇 |
2016年 | 77篇 |
2015年 | 51篇 |
2014年 | 120篇 |
2013年 | 176篇 |
2012年 | 137篇 |
2011年 | 146篇 |
2010年 | 166篇 |
2009年 | 220篇 |
2008年 | 240篇 |
2007年 | 285篇 |
2006年 | 213篇 |
2005年 | 173篇 |
2004年 | 141篇 |
2003年 | 150篇 |
2002年 | 151篇 |
2001年 | 114篇 |
2000年 | 106篇 |
1999年 | 96篇 |
1998年 | 108篇 |
1997年 | 85篇 |
1996年 | 74篇 |
1995年 | 53篇 |
1994年 | 54篇 |
1993年 | 52篇 |
1992年 | 37篇 |
1991年 | 31篇 |
1990年 | 22篇 |
1989年 | 26篇 |
1988年 | 28篇 |
1987年 | 21篇 |
1986年 | 18篇 |
1985年 | 24篇 |
1984年 | 28篇 |
1983年 | 5篇 |
1982年 | 18篇 |
1981年 | 12篇 |
1980年 | 13篇 |
1979年 | 8篇 |
1978年 | 12篇 |
1977年 | 8篇 |
1976年 | 8篇 |
1957年 | 2篇 |
排序方式: 共有3835条查询结果,搜索用时 15 毫秒
1.
Erosion and sediments transport processes have a great impact on industrial structures and on water quality. Despite its limitations, the Saint‐Venant‐Exner system is still (and for sure for some years) widely used in industrial codes to model the bedload sediment transport. In practice, its numerical resolution is mostly handled by a splitting technique that allows a weak coupling between hydraulic and morphodynamic distinct softwares but may suffer from important stability issues. In recent works, many authors proposed alternative methods based on a strong coupling that cure this problem but are not so trivial to implement in an industrial context. In this work, we then pursue 2 objectives. First, we propose a very simple scheme based on an approximate Riemann solver, respecting the strong coupling framework, and we demonstrate its stability and accuracy through a number of numerical test cases. However, second, we reinterpret our scheme as a splitting technique and we extend the purpose to propose what should be the minimal coupling that ensures the stability of the global numerical process in industrial codes, at least, when dealing with collocated finite volume method. The resulting splitting method is, up to our knowledge, the only one for which stability properties are fully demonstrated. 相似文献
2.
G. Montero L. Gonzlez E. Flrez M. D. García A. Surez 《Numerical Linear Algebra with Applications》2002,9(3):239-247
Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, minM∈??∥AM?I∥ F and matrix M0∈?? corresponding to this minimum (?? being any vectorial subspace of ??n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
3.
In a previous paper (Ref. 1), an exact solution of the optimal planar interception with fixed end conditions was derived in closed form. The optimal control was expressed as an explicit function of the state variables and two fixed parameters, obtained by solving a set of nonlinear algebraic equations involving elliptic integrals. In order to facilitate the optimal control implementation, the present paper derives a highly accurate simplified solution assuming that the ratio of the pursuer turning radius to the initial range is small. An asymptotic expansion further reduces the computational workload. Construction of a near-optimal open-loop control, based on the approximations, completes the present paper. 相似文献
4.
V. Dzhunushaliev 《Foundations of Physics》2002,32(7):1069-1090
An approximate model of a spacetime foam is presented. It is supposed that in the spacetime foam each quantum handle is like to an electric dipole and therefore the spacetime foam is similar to a dielectric. If we neglect of linear sizes of the quantum handle then it can be described with an operator containing a Grassman number and either a scalar or a spinor field. For both fields the Lagrangian is presented. For the scalar field it is the dilaton gravity + electrodynamics and the dilaton field is a dielectric permeability. The spherically symmetric solution in this case give us the screening of a bare electric charge surrounded by a polarized spacetime foam and the energy of the electric field becomes finite one. In the case of the spinor field the spherically symmetric solution give us a ball of the polarized spacetime foam filled with the confined electric field. It is shown that the full energy of the electric field in the ball can be very big. 相似文献
5.
Fabio Schoen 《Journal of Global Optimization》1991,1(3):207-228
In this paper stochastic algorithms for global optimization are reviewed. After a brief introduction on random-search techniques, a more detailed analysis is carried out on the application of simulated annealing to continuous global optimization. The aim of such an analysis is mainly that of presenting recent papers on the subject, which have received only scarce attention in the most recent published surveys. Finally a very brief presentation of clustering techniques is given. 相似文献
6.
Vivek F. Farias 《Operations Research Letters》2006,34(2):180-190
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility. 相似文献
7.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献
8.
Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability. 相似文献
9.
The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed. 相似文献
10.
Johan Helsing 《BIT Numerical Mathematics》2006,46(2):307-323
A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come
from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating
distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar
to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that
of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with
up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners
of otherwise similar construction, and especially so when the preconditioners are very sparse.
AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30 相似文献